Evaluating Various Quality Factors for Splitting Nodes in Tree-Structured Spatial Indices
نویسندگان
چکیده
منابع مشابه
Tree-structured Partitioning Based on Splitting Histograms of Distances
We propose a novel clustering algorithm that is similar in spirit to classification trees. The data is recursively split using a criterion that applies a discrete curve evolution method to the histogram of distances. The algorithm can be depicted through tree diagrams with triple splits. Leaf nodes represent either clusters or sets of observations that can not yet be clearly assigned to a clust...
متن کاملEvaluating the Importance of Various Implicit Factors in E-commerce
In this paper, we focus on the situation of a typical e-commerce portal employing personalized recommendation. Such website could, in addition to the explicit feedback, monitor many different patterns of implicit user behavior – implicit factors. The problem arises while trying to infer connections between observed implicit behavior and user preferences while some connections are obvious, other...
متن کاملTree - Decision Trees for Tree Structured Data∗
We present Tree, a new approach to structural classification. This integrated approach induces decision trees that test for pattern occurrence in the inner nodes. It combines state-of-the-art tree mining with sophisticated pruning techniques to find the most discriminative pattern in each node. In contrast to existing methods, Tree uses no heuristics and only a single, statistically well founde...
متن کاملTowards Private Navigation of Tree Structured Spatial Indexes
With many location-based services, spatial data such as points of interest are indexed at a potentially untrusted host and queries are evaluated by navigating the underlying index structure used to partition the data. While encryption can prevent the host from learning the data content (i.e., what is accessed), it cannot hide the frequency that index nodes are accessed while navigating the inde...
متن کاملTree-Structured Composition in Neural Networks without Tree-Structured Architectures
Tree-structured neural networks encode a particular tree geometry for a sentence in the network design. However, these models have at best only slightly outperformed simpler sequence-based models. We hypothesize that neural sequence models like LSTMs are in fact able to discover and implicitly use recursive compositional structure, at least for tasks with clear cues to that structure in the dat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2018
ISSN: 0975-8887
DOI: 10.5120/ijca2018916709